Privacy-Preserving Classification of Horizontally Partitioned Data via Random Kernels
نویسندگان
چکیده
We propose a novel privacy-preserving nonlinear support vector machine (SVM) classifier for a data matrix A whose columns represent input space features and whose individual rows are divided into groups of rows. Each group of rows belongs to an entity that is unwilling to share its rows or make them public. Our classifier is based on the concept of a reduced kernel K(A,B) where B is the transpose of a completely random matrix B. The proposed classifier, which is public but does not reveal the privately-held data, has accuracy comparable to that of an ordinary SVM classifier based on the entire data.
منابع مشابه
Privacy Preserving ID3 over Horizontally, Vertically and Grid Partitioned Data
We consider privacy preserving decision tree induction via ID3 in the case where the training data is horizontally or vertically distributed. Furthermore, we consider the same problem in the case where the data is both horizontally and vertically distributed, a situation we refer to as grid partitioned data. We give an algorithm for privacy preserving ID3 over horizontally partitioned data invo...
متن کاملA Novel Protocol For Privacy Preserving Decision Tree Over Horizontally Partitioned Data
In recent times, there have been growing interests on how to preserve the privacy in data mining when sources of data are distributed across multi-parties. In this paper, we focus on the privacy preserving decision tree classification in multi-party environment when data are horizontally partitioned. We develop new and simple algorithm to classify the horizontally partitioned multi-party data. ...
متن کاملPrivacy Preserving Naive Bayes Classifier for Horizontally Partitioned Data
The problem of secure distributed classification is an important one. In many situations, data is split between multiple organizations. These organizations may want to utilize all of the data to create more accurate predictive models while revealing neither their training data / databases nor the instances to be classified. The Naive Bayes Classifier is a simple but efficient baseline classifie...
متن کاملPrivacy-Preserving Decision Tree Classification Over Horizontally Partitioned Data
Protection of privacy is one of important problems in data mining. The unwillingness to share their data frequently results in failure of collaborative data mining. This paper studies how to build a decision tree classifier under the following scenario: a database is horizontally partitioned into multiple pieces, with each piece owned by a particular party. All the parties want to build a decis...
متن کاملPrivacy Preserving Naïve Bayes Classifier for Horizontally Distribution Scenario Using Un-trusted Third Party
The aim of the classification task is to discover some kind of relationship between the input attributes and the output class, so that the discovered knowledge can be used to predict the class of a new unknown tuple. The problem of secure distributed classification is an important one. In many situations, data is split between multiple organizations. These organizations may want to utilize all ...
متن کامل